int findMaxConsecutiveOnes(int* nums, int numsSize){
    int max = 0;
    int tmp = 0;
    for (int i = 0; i < numsSize; i++) {
        if (nums[i] == 0) { 
            max = fmax(tmp, max);
            tmp = 0;
            continue;
        }
        tmp += 1;
    }
    if (nums[numsSize - 1] != 0) max = fmax(tmp, max);

    return max;
}